Extension of the Karp and Miller Procedure to Lotos Specifications
نویسندگان
چکیده
Abstract In a companion paper [Barb 90a,b], we proposed a Place/Transition-net (P/T-net) semantics for a subset of Lotos. This subset is such that Lotos .specifications can be translated into finite structure Petri nets. It is therefore possible to apply P/T-net verification techniques since they require finite structure. It this paper, we demonstrate that it is possible to apply P/T-net verification methods without an a priori construction of the P/T-net associated to the Lotos specification to be analysed. In particular we consider a weU known reachability analysis technique for P/T-nets, namely, the Karp and Miller procedure.
منابع مشابه
The Lotos Model of a Fault Protected System and its Verification Using a Petri Net Based Approach
Having introduced a novel Petri net based method for the verification of Lotes specifications [Barb 90a], this paper demonstrates its practical interest. Contrary to other similar Petri net based techniques, our approach avoids to build the whole Petri net from the Lotos specification before verification. In contrast to finite automata based methods, our method can analyse Lotos systems with un...
متن کاملThe Invoicing Case Study in (E-)LOTOS
The informal requirements for the invoicing case study are analysed and interpreted. This leads to a high-level specification architecture that can be formalised. Specifications are presented in LOTOS (Language Of Temporal Ordering Specification). For comparison, specifications are also presented E-LOTOS (Enhancements to LOTOS) – the new version of LOTOS currently being standardised. Since LOTO...
متن کاملA Reachability Analysis of RT-LOTOS Specifications
The paper deals with the veriication of RT-LOTOS speciications, RT-LOTOS being an acronym of Real-Time LOTOS, a temporal extension of the LOTOS FDT. Veriication is performed by reachability analysis of a timed automaton model into which a RT-LOTOS speciication may be automatically translated. Two main contributions are brought by this paper: the deenition of a new timed automaton model, the dyn...
متن کاملA LOTOS Data Facility Compiler (DAFY)1
If we take a look at existing LOTOS specifications, we notice that the description of the needed data types is very often huge. This causes the lack of concision of most descriptions of complex systems. We propose to tackle this problem in two steps. First, we define extensions to the LOTOS language allowing short definitions of most of the data types used in practical LOTOS specifications. Sec...
متن کاملKarp-Miller Trees for a Branching Extension of VASS
We study BVASS (Branching VASS) which extend VASS (Vector Addition Systems with States) by allowing addition transitions that merge two configurations. Runs in BVASS are tree-like structures instead of linear ones as for VASS. We show that the construction of Karp-Miller trees for VASS can be extended to BVASS. This entails that the coverability set for BVASS is computable.
متن کامل